An algorithm for solving a capacitated indefinite quadratic transportation problem with enhanced flow
نویسندگان
چکیده
منابع مشابه
An Algorithm for Solving an Indefinite Quadratic Transportation Problem with Specified Flow
In the present paper, an indefinite quadratic transportation problem with specified flow is studied. If in addition to the flow constraint, the minimum requirement of each destination is also specified then the situation arises of distributing at minimum cost a certain commodity produced in a country, after keeping reserve stocks, to various states with minimum requirement of each state specifi...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولa model and extended algorithm for solving an inventory control problem with transportation costs
in this paper, a supplier-retailer transportation system is investigated as a two-echelon environment. there is a single location in each echelon; the unique supplier at the first echelon has to replenish the retailer's warehouse at the second echelon. by the way, the shortage situation should be avoided. for this situation, a model is provided based on the traditional eoq model. the inven...
متن کاملA hybrid based genetic algorithm for solving a capacitated fixed-charge transportation problem
This paper is focusing on an important transportation application encountered in supply chains, namely the capacitated two-stage fixed-charge transportation problem. For solving this complex optimization problem we described a novel hybrid heuristic approach obtained by combining a genetic algorithm based on a hash table coding of the individuals with a powerful local search procedure. The prop...
متن کاملAbout One Sweep Algorithm for Solving Linear-Quadratic Optimization Problem with Unseparated Two-Point Boundary Conditions
In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2014
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor120823043g